Theoretical Complexity of Grid Cover Problems Used in Radar Applications
نویسندگان
چکیده
منابع مشابه
Parameterized Complexity of Generalized Vertex Cover Problems
Important generalizations of the Vertex Cover problem (Connected Vertex Cover,Capacitated Vertex Cover, andMaximum Partial Vertex Cover) have been intensively studied in terms of approximability. However, their parameterized complexity has so far been completely open. We close this gap here by showing that, with the size of the desired vertex cover as parameter, Connected Vertex Cover and Capac...
متن کاملthe effect of task complexity on efl learners’ written task performance in terms of accuracy and complexity
هدف اصلی این تحقیق بررسی تاثیر افزایش میزان پیچیدگی تکالیف مکالمه محور بر دقت و صحت و پیچیدگی عملکرد نوشتاری زبان آموزان می باشد. بدین منظور، 50 نفر از دانش آموزان دختر در رده ی سنی 15 الی 18 سال درسطح pre-intermediate از طریق petو vhs تست به عنوان شرکت کنندگان در تحقیق انتخاب شدند و به دو گروه آزمایشی و کنترل بصورت اتفاقی تقسیم شدند. اعضای گروه آزمایشی دو تکلیف ساده و پیچیده را طی 2 جلسه انجام...
Generalized Submodular Cover Problems and Applications
The greedy approach has been successfully applied in the past to produce logarithmic ratio approximations to NP-hard problems under certain conditions. The problems for which these conditions hold are known as submodular cover problems. The current paper 1 extends the applicability of the greedy approach to wider classes of problems. The usefulness of our extensions is illustrated by giving new...
متن کاملThe Complexity of Crowdsourcing: Theoretical Problems in Human Computation
What does theoretical computer science have to say about human computation? We identify three problems at the intersection of crowdsourcing, operations research, and theoretical computer science whose solution would have a major impact on the design, evaluation, and construction of real crowdsourcing systems. In some cases, these problems can let us sidestep apparently difficult HCI challenges ...
متن کاملA review of dough rheological models used in numerical applications
The motivation for this work is to propose a first thorough review of dough rheological models used in numerical applications. Although many models have been developed to describe dough rheological characteristics, few of them are employed by researchers in numerical applications. This article reviews them in detail and attempts to provide new insight into the use of dough rheological models.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2018
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-018-1354-x